Ambiguity Resolution for Sketched Diagrams by Syntax Analysis Based on Graph Grammars
نویسندگان
چکیده
Sketching, i.e., drawing diagrams by hand and directly on the screen, is gaining popularity, as it is a comfortable and natural way to create and edit diagrams. Hand drawing is inherently imprecise, and often sloppy. As a consequence, when processing hand drawn diagrams with a computer, ambiguities arise: it is not always clear what part of the drawing is meant to represent what component. Resolution of these ambiguities is the main issue of sketching. Ambiguity can only be solved by exploring the context of ambiguous components. This paper describes ambiguity resolution by syntax analysis in DIAGEN, a generic framework for generating diagram editors. Such editors support free-hand editing (which is closely related to sketching), and allow for analyzing the created diagrams based on a hypergraph grammar. Our approach adds support for sketching to the generated editors. In order to resolve the ambiguities in sketched diagrams, DIAGEN’s diagram analysis based on graph parsing is used. The necessary modifications to DIAGEN and its graph parser in particular are discussed.
منابع مشابه
Event-Driven Grammars: Towards the Integration of Meta-modelling and Graph Transformation
In this work we introduce event-driven grammars, a kind of graph grammars that are especially suited for visual modelling environments generated by meta-modelling. Rules in these grammars may be triggered by user actions (such as creating, editing or connecting elements) and in its turn may trigger other user-interface events. Its combination with (non-monotonic) triple graph grammars allows co...
متن کاملA Graph Grammar Approach to Software Architecture Verification and Transformation
Software architecture and design are usually modeled and represented by informal diagrams, such as architecture diagrams and UML diagrams. While these graphic notations are easy to understand and are convenient to use, they are not amendable to automated verification and transformation. This paper provides graph grammars for architecture and UML class diagrams. These grammars enable a high leve...
متن کاملAmbiguity in Visual Language Theory and Its Role in Diagram Parsing
To take advantage of the ever-increasing volume of diagrams in electronic form, it is crucial that we have methods for parsing diagrams. Once a structured, content-based description is built for a diagram, it can be indexed for search, retrieval, and use. Whenever broadcoverage grammars are built to parse a wide range of objects, whether natural language or diagrams, the grammars will overgener...
متن کاملRelative clause attachment ambiguity resolution in Persian
The present study seeks to find the way Persian native speakers resolve relative clause attachment ambiguities in sentences containing a complex NP of the type NP of NP followed by a relative clause (RC). Previous off-line studies have found a preference for high attachment in the present study, an on-line technique was used to help identify the nature of this process. Persian speakers were pre...
متن کاملA Context-sensitive Graph Grammar Formalism for the Specification of Visual Languages
Graph grammars may be used as natural and powerful syntax-definition formalisms for visual programming languages. Yet most graph-grammar parsing algorithms presented so far are either unable to recognize interesting visual languages or tend to be inefficient (with exponential time complexity) when applied to graphs with a large number of nodes and edges. This paper presents a context-sensitive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ECEASST
دوره 10 شماره
صفحات -
تاریخ انتشار 2008